BSC Thresholds for Code Ensembles Based on "Typical Pairs" Decoding*
ثبت نشده
چکیده
منابع مشابه
Graph-based Codes and Iterative Decoding
The field of error correcting codes was revolutionized by the introduction of turbo codes [7] in 1993. These codes demonstrated dramatic performance improvements over any previously known codes, with significantly lower complexity. Since then, much progress has been made towards understanding the performance of these codes, as well as in using this understanding to design even better codes. Thi...
متن کاملInformation Transfer Bounds on Iterative Thresholds of Staircase Codes
We consider staircase codes and study their performance using an analysis of the decoding information flow. We derive bounds on the information transfer functions for long binary linear codes serving as component codes for staircase ensembles and compute them for several BCH codes and bounded distance decoding. The resulting expressions are used to obtain upper bounds on the iterative threshold...
متن کاملStatistical mechanics of typical set decoding.
The performance of "typical set (pairs) decoding" for ensembles of Gallager's linear code is investigated using statistical physics. In this decoding method, errors occur, either when the information transmission is corrupted by atypical noise, or when multiple typical sequences satisfy the parity check equation as provided by the received corrupted codeword. We show that the average error rate...
متن کاملOn Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing
This paper considers the achievable rates and decoding complexity of low-density parity-check (LDPC) codes over statistically independent parallel channels. The paper starts with the derivation of bounds on the conditional entropy of the transmitted codeword given the received sequence at the output of the parallel channels; the component channels are considered to be memoryless, binary-input, ...
متن کاملOn the Asymptotic Input-Output Weight Distributions and Thresholds of Convolutional and Turbo-Like Codes
We present a general method for computing the asymptotic input-output weight distribution of convolutional encoders. In some instances, one can derive explicit analytic expressions. In general though, to determine the growth rate of the input-output weight distribution for a particular normalized input weight κ and output weight ω, a system of polynomial equations has to be solved. This method ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001